Line Transversals to Translates of a Convex Body

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Line Transversals to Translates of Unit Discs

Let F be a family of convex figures in the plane. We say that F has property T if there exist a line intersecting every member of F . Also, we say that the family F has property T (k) if every k−membered subfamily of F has property T . In this talk we will give some results concerning families of translates of the unit disc which have property T (3) or T (4).

متن کامل

Line transversals of convex polyhedra in R3

We establish a bound of O(nk), for any ε > 0, on the combinatorial complexity of the setT of line transversals of a collection P of k convex polyhedra in R with a total of n facets, andpresent a randomized algorithm which computes the boundary of T in comparable expectedtime. Thus, when k ¿ n, the new bounds on the complexity (and construction cost) of Timprove upon the previous...

متن کامل

Transversal numbers of translates of a convex body

Let F be a family of translates of a fixed convex set M in Rn. Let (F) and (F) denote the transversal number and the independence number of F, respectively. We show that (F) (F) 8 (F) − 5 for n = 2 and (F) 2n−1nn (F) for n 3. Furthermore, if M is centrally symmetric convex body in the plane, then (F) (F) 6 (F)− 3. © 2006 Elsevier B.V. All rights reserved.

متن کامل

Coloring translates and homothets of a convex body

We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finite families of translates and homothets of a convex body in R.

متن کامل

Convex Transversals

We answer the question initially posed by Arik Tamir at the Fourth NYU Computational Geometry Day (March, 1987): “Given a collection of compact sets, can one decide in polynomial time whether there exists a convex body whose boundary intersects every set in the collection?” We prove that when the sets are segments in the plane, deciding existence of the convex stabber is NP-hard. The problem re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2010

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-010-9293-9